A Lagrangian formulation of Zador's entropy-constrained quantization theorem

نویسندگان

  • Robert M. Gray
  • Tamás Linder
  • Jia Li
چکیده

Zador’s classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorithm used to optimize such quantizers. The equivalence of the two formulations is shown and the result is proved for source distributions that are absolutely continuous with respect to the Lebesgue measure which satisfy an entropy condition, thereby generalizing the conditions stated by Zador under which the result holds.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lagrangian Formulation of Zador ' sEntropy - Constrained Quantization Theorem 1

Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorithm used to optimize such quantizers. The equivalence of the two formulations is shown and the result is proved for source distributions that are absolutely continuous with respect to the Lebesgue measure which satisfy an ent...

متن کامل

On Zador's Entropy-Constrained Quantization Theorem

Zador’s classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorithm used to optimize such quantizers. A proof that the result holds for a general class of distributions is sketched.

متن کامل

Asymptotic Quantization: A Method for Determining Zador’s Constant

“By applying the Lloyd clustering algorithm to a L a g r a n g i a n formulation of Zador's result, it is possible to obtain n u m e r i c a l estimates of Zador's constant.” Introduction With the growth of the internet and digital media, data compression is becoming increasingly important due to the overwhelming abundance of information that computer users wish to transmit and store. Quantizat...

متن کامل

When Optimal Entropy-constrained Quantizers Have a Finite or Innnite Number of Codewords

An entropy-constrained quantizer Q is optimal if it minimizes the expected distortion D(Q) subject to a constraint on the output entropy H(Q). In this paper we use the Lagrangian formulation to show the existence and study the structure of optimal entropy-constrained quantizers that achieve a point on the lower convex hull of the operational distortion-rate function D h (R) = inf Q fD(Q) : H(Q)...

متن کامل

Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?

An entropy-constrained quantizer Q is optimal if it minimizes the expected distortion D(Q) subject to a constraint on the output entropy H(Q). In this paper we use the Lagrangian formulation to show the existence and study the structure of optimal entropy-constrained quantizers that achieve a point on the lower convex hull of the operational distortion-rate function Dh(R) = infQ{D(Q) : H(Q) ≤ R...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2002